/// @tags: Manhattan Distance
#include <algorithm>
#include <cctype>
#include <cstdio>

template <typename T>
inline T &read(T &x) {
  x = 0;
  bool f = false;
  short ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = true;
    ch = getchar();
  }
  while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ '0'), ch = getchar();
  if (f) x = -x;
  return x;
}

const int N = 5e4 + 5;
int n, x[N], y[N];

int main() {
#ifndef ONLINE_JUDGE
#ifdef LOCAL
  freopen64("/tmp/CodeTmp/testdata.in", "r", stdin);
  freopen64("/tmp/CodeTmp/testdata.out", "w", stdout);
#else
  freopen("P5098 [USACO04OPEN]Cave Cows 3.in", "r", stdin);
  freopen("P5098 [USACO04OPEN]Cave Cows 3.out", "w", stdout);
#endif
#endif

  read(n);
  for (int i = 1, _x, _y; i <= n; ++i) {
    read(_x), read(_y);
    x[i] = _x + _y;
    y[i] = _x - _y;
  }
  std::sort(x + 1, x + n + 1);
  std::sort(y + 1, y + n + 1);
  int ans = std::max(x[n] - x[1], y[n] - y[1]);
  printf("%d", ans);
  return 0;
}